Optimal placement of warehouse cross aisles in a picker-to-part warehouse with class-based storage
نویسندگان
چکیده
Given a picker-to-part warehouse having a simple rectilinear aisle arrangement with north2 south storage aisles and east-west travel aisles (or “cross aisles”), this paper investigates the 3 optimal placement of the cross aisles as a consequence of the probability density function of the 4 order pick locations, as determined by the storage policy. That is, for a given storage policy, 5 what placement of the cross aisles will result in a minimal expected path length for the picker? 6 An analytical solution procedure is developed for the optimal placement of a single middle 7 cross aisle given for a given storage policy. A simplifying assumption is made as regards picker 8 routing, but arbitrary non-random storage policies are considered. The solution procedure is 9 generalized to a method for multiple cross aisles. Some example problems are solved and a 10 simulation study is used to measure the impact of our simplifying assumptions. 11
منابع مشابه
Routing methods for warehouses with multiple cross aisles
This paper considers routing and layout issues for parallel aisle warehouses. In such warehouses order pickers walk or drive along the aisles to pick products from storage. They can change aisles at a number of cross aisles. These cross aisles are usually located at the front and back of the warehouse, but there can also be one or more cross aisles at positions in between. We describe a number ...
متن کاملLayout Design of Multiple Blocks Class-Based Storage Strategy Warehouses
Manual order-picking warehouses are highly influenced by its’ layout design. In fact, layout parameters play the most important role in determining the route length which is responsible for the largest share in a warehouse operating costs. Conventional simulation techniques are not capable to capture the complexities in dynamic systems. Therefore, this paper develops an agent-based model to sim...
متن کاملOptimally solving the joint order batching and picker routing problem
In this work we investigate the problem of order batching and picker routing in storage areas. These are labour and capital intensive problems, often responsible for a substantial share of warehouse operating costs. In particular, we consider the case of online grocery shopping in which orders may be composed of dozens of items. We present a formulation for the problem based on an exponential n...
متن کاملA new mathematical programming formulation for the Single-Picker Routing Problem
The Single-Picker Routing Problem deals with the determination of sequences according to which items have to be picked in a distribution warehouse and the identification of the corresponding paths which have to be travelled by human operators (order pickers). The Single-Picker Routing Problem represents a special case of the classic Traveling Salesman Problem (TSP) and, therefore, can also be m...
متن کاملTravel Models for Warehouses with Task Interleaving
Unit-load warehouses receive and ship material or products in single discrete units, usually as pallet loads. They are commonly found in industry; examples include third-party transshipment warehouses, grocery and beverage distributors, appliance manufacturers and import distribution centers. Many break-bulk facilities, which break down a pallet into smaller volume packages for shipment, also h...
متن کامل